A Parallel Genetic Algorithm for Maximum Flow Problem
نویسندگان
چکیده
منابع مشابه
A Parallel Genetic Algorithm for Maximum Flow Problem
The maximum flow problem is a type of network optimization problem in the flow graph theory. Many important applications used the maximum flow problem and thus it has been studied by many researchers using different methods. Ford Fulkerson algorithm is the most popular algorithm that used to solve the maximum flow problem, but its complexity is high. In this paper, a parallel Genetic algorithm ...
متن کاملA Parallel Ford-Fulkerson Algorithm For Maximum Flow Problem
The maximum flow problem is one of the most fundamental problems in network flow theory and has been investigated extensively. The Ford-Fulkerson algorithm is a simple algorithm to solve the maximum flow problem based on the idea of augmenting path. But its time complexity is high and it’s a pseudo-polynomial time algorithm. In this paper, a parallel Ford-Fulkerson algorithm is given. The idea ...
متن کاملA genetic algorithm approach for problem
In this paper, a genetic algorithm is presented for an identical parallel-machine scheduling problem with family setup time that minimizes the total weighted flow time ( ). No set-up is necessary between jobs belonging to the same family. A set-up must be scheduled when switching from the processing of family i jobs to those of another family j, i j, the duration of this set-up being the sequ...
متن کاملA Genetic Algorithm Applied to the Maximum Flow Problem
A genetic algorithms is applied to find a maximum flow from the source to sink in a weighted directed graph, where the weight associated with each edge represents its flow capacity in one direction. The maximum flow problem appears to be more challenging in applying genetic algorithms than many other common graph problems because of its several unique characteristics. For example, a flow at eac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2017
ISSN: 2156-5570,2158-107X
DOI: 10.14569/ijacsa.2017.080620